Tangible reduction in learning sample complexity with large classical samples and small quantum system
نویسندگان
چکیده
Quantum computation requires large classical datasets to be embedded into quantum states in order exploit parallelism. However, this embedding considerable resources. It would therefore desirable avoid it, if possible, for noisy intermediate-scale (NISQ) implementation. Accordingly, we consider a classical-quantum hybrid architecture, which allows input data, with relatively small-scale system. This architecture is used implement an oracle. shown that the presence of noise oracle, effects internal can cancel each other out and thereby improve query success rate. also such immunity oracle directly tangibly reduces sample complexity probably-approximately-correct learning framework. NISQ-compatible advantage attributed oracle's ability handle features.
منابع مشابه
Optimal Quantum Sample Complexity of Learning Algorithms
In learning theory, the VC dimension of a concept class C is the most common way to measure its “richness.” A fundamental result says that the number of examples needed to learn an unknown target concept c ∈ C under an unknown distribution D, is tightly determined by the VC dimension d of the concept class C . Specifically, in the PAC model Θ ( d ε + log(1/δ) ε ) examples are necessary and suff...
متن کاملTight Sample Complexity of Large-Margin Learning
We obtain a tight distribution-specific characterization of the sample complexity of large-margin classification with L2 regularization: We introduce the γ-adapted-dimension, which is a simple function of the spectrum of a distribution’s covariance matrix, and show distribution-specific upper and lower bounds on the sample complexity, both governed by the γ-adapted-dimension of the source distr...
متن کاملClassical complexity and quantum entanglement
Generalizing a decision problem for bipartite perfect matching, Edmonds (J. Res. Natl. Bur. Standards 718(4) (1967) 242) introduced the problem (now known as the Edmonds Problem) of deciding if a given linear subspace ofM(N) contains a non-singular matrix, whereM(N) stands for the linear space of complexN ×N matrices. This problem led to many fundamental developments in matroid theory, etc. Cla...
متن کاملReduction Procedures in Classical and Quantum Mechanics
We present, in a pedagogical style, many instances of reduction procedures appearing in a variety of physical situations, both classical and quantum. We concentrate on the essential aspects of any reduction procedure, both in the algebraic and geometrical setting, elucidating the analogies and the differences between the classical and the quantum situations.
متن کاملDistribution-dependent sample complexity of large margin learning
We obtain a tight distribution-specific characterization of the sample complexity of large-margin classification with L2 regularization: We introduce the margin-adapted dimension, which is a simple function of the second order statistics of the data distribution, and show distribution-specific upper and lower bounds on the sample complexity, both governed by the margin-adapted dimension of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information Processing
سال: 2021
ISSN: ['1573-1332', '1570-0755']
DOI: https://doi.org/10.1007/s11128-021-03217-7